Alternation Elimination for Automata over Nested Words
نویسندگان
چکیده
This paper presents constructions for translating alternating automata into nondeterministic nested-word automata (NWAs). With these alternation-elimination constructions at hand, we straightforwardly obtain translations from various temporal logics over nested words from the literature like CaRet and μNWTL, and extensions thereof to NWAs, which correct, simplify, improve, and generalize the previously given translations. Our alternation-elimination constructions are instances of an alternation-elimination scheme for automata that operate over the tree unfolding of graphs. We obtain these instances by providing constructions for complementing restricted classes of automata with respect to the graphs given by nested words. The scheme generalizes our alternation-elimination scheme for word automata and the presented complementation constructions generalize existing complementation constructions for word automata.
منابع مشابه
The μ-calculus alternation hierarchy collapses over structures with restricted connectivity
It is known that the alternation hierarchy of least and greatest fixpoint operators in the μ-calculus is strict. However, the strictness of the alternation hierarchy does not necessarily carry over when considering restricted classes of structures. A prominent instance is the class of infinite words over which the alternation-free fragment is already as expressive as the full μ-calculus. Our cu...
متن کاملThe \mu-Calculus Alternation Hierarchy Collapses over Structures with Restricted Connectivity
It is known that the alternation hierarchy of least and greatest fixpoint operators in the μ-calculus is strict. However, the strictness of the alternation hierarchy does not necessarily carry over when considering restricted classes of structures. A prominent instance is the class of infinite words over which the alternation-free fragment is already as expressive as the full μ-calculus. Our cu...
متن کاملOn the Expressive Power of 2-Stack Visibly Pushdown Automata
Visibly pushdown automata are input-driven pushdown automata that recognize some non-regular context-free languages while preserving the nice closure and decidability properties of finite automata. Visibly pushdown automata with multiple stacks have been considered recently by La Torre, Madhusudan, and Parlato, who exploit the concept of visibility further to obtain a rich pushdown-automata cla...
متن کاملExplorer Regular Languages of Nested Words : Fixed Points , Automata , and Synchronization
Nested words provide a natural model of runs of programs with recursive procedure calls. The usual connection between monadic second-order logic (MSO) and automata extends from words to nested words and gives us a natural notion of regular languages of nested words. In this paper we look at some well-known aspects of regular languages – their characterization via fixed points, deterministic and...
متن کاملInkdot versus Pebble over Two-Dimensional Languages
This paper investigates a relationship between inkdot and one-pebble for two-dimensional finite automata (2-fa’s). Especially we show that (1) alternating inkdot 2-fa’s are more powerful than nondeterministic one-pebble 2-fa’s, and (2) there is a set accepted by an alternating inkdot 2-fa, but not accepted by any alternating one-pebble 2-fa with only universal states. key words: inkdot, pebble,...
متن کامل